Misura di masse comprese fra gr. 10-1 E gr. 10-6.
نویسندگان
چکیده
منابع مشابه
On Gr-functors between Gr-categories
Each Gr-category (or categorical group) is Gr-equivalent to a Grcategory of type (Π, A, ξ), where Π is a group, A is a Π-module and ξ is a 3-cocycle of Π, with coefficients in A. In this paper, first we show that each Gr-functor induces one between Gr-categories of type (Π, C). Then we give results on the existence of Gr-functor and the classification of Gr-functors by cohomology groups H(Π, C)...
متن کاملSlugs: Extensible GR(1) Synthesis
Applying reactive synthesis in practice often requires modifications of the synthesis algorithm in order to obtain useful implementations. We present slugs, a generalized reactivity(1) synthesis tool that has a powerful plugin architecture for modifying any aspect of the synthesis process to fit the application. Slugs comes pre-equipped with a variety of plugins that improve the quality of the ...
متن کاملON GR-FUNCTORS BETWEEN GR-CATEGORIES: OBSTRUCTION THEORY FOR GR-FUNCTORS OF THE TYPE (φ, f)
Each Gr-functor of the type (φ, f) of a Gr-category of the type (Π, C) has the obstruction be an element k ∈ H(Π, C). When this obstruction vanishes, there exists a bijection between congruence classes of Gr-functors of the type (φ, f) and the cohomology group H(Π,C). Then the relation of Gr-category theory and the group extension problem can be established and used to prove that each Gr-catego...
متن کاملFEAST / 1 Final Report - Grant Number GR
Background: The project was conceived in 1994 following formulation of a FEAST hypothesis. This stated that the software evolution process is a feedback system and must be treated as such to achieve major process improvement. Three self-funding international workshops were held at IC [fea94,5] to explore the hypothesis, with some 40 participants from the UK, Europe and North America at each. Fo...
متن کاملRevisiting Synthesis of GR(1) Specifications
The last few years have seen a rising interest in the problem of synthesizing systems from temporal logic specifications. One major contributor to this is the recent work of Piterman et al., which showed how polynomial time synthesis could be achieved for a class of LTL specifications that is large enough and expressive enough to cover an extensive number of complex, real-world, applications (d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Il Nuovo Cimento Series 5
سال: 1902
ISSN: 0029-6341,1827-6121
DOI: 10.1007/bf02717793